0.04/0.07	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.04/0.07	% Command    : run_E %s %d THM
0.07/0.25	% Computer : n024.cluster.edu
0.07/0.25	% Model    : x86_64 x86_64
0.07/0.25	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.07/0.25	% Memory   : 8042.1875MB
0.07/0.25	% OS       : Linux 3.10.0-693.el7.x86_64
0.07/0.25	% CPULimit   : 960
0.07/0.25	% WCLimit    : 120
0.07/0.25	% DateTime   : Tue Aug  9 02:55:52 EDT 2022
0.07/0.26	% CPUTime    : 
0.10/0.37	Running higher-order on 8 cores theorem proving
0.10/0.37	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.10/0.37	# Version: 3.0pre003-ho
0.10/0.38	# Preprocessing class: HSMSSMSSMLMNHSN.
0.10/0.38	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.10/0.38	# Starting ho_unfolding_3 with 600s (5) cores
0.10/0.38	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.10/0.38	# Starting almost_fo_3_lam with 120s (1) cores
0.10/0.38	# Starting post_as_ho1 with 120s (1) cores
0.10/0.38	# almost_fo_3_lam with pid 19280 completed with status 0
0.10/0.38	# Result found by almost_fo_3_lam
0.10/0.38	# Preprocessing class: HSMSSMSSMLMNHSN.
0.10/0.38	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.10/0.38	# Starting ho_unfolding_3 with 600s (5) cores
0.10/0.38	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.10/0.38	# Starting almost_fo_3_lam with 120s (1) cores
0.10/0.38	# No SInE strategy applied
0.10/0.38	# Search class: HGHNF-FFSF11-SHSSMFNN
0.10/0.38	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.10/0.38	# Starting new_ho_10 with 65s (1) cores
0.10/0.38	# new_ho_10 with pid 19282 completed with status 0
0.10/0.38	# Result found by new_ho_10
0.10/0.38	# Preprocessing class: HSMSSMSSMLMNHSN.
0.10/0.38	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.10/0.38	# Starting ho_unfolding_3 with 600s (5) cores
0.10/0.38	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.10/0.38	# Starting almost_fo_3_lam with 120s (1) cores
0.10/0.38	# No SInE strategy applied
0.10/0.38	# Search class: HGHNF-FFSF11-SHSSMFNN
0.10/0.38	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.10/0.38	# Starting new_ho_10 with 65s (1) cores
0.10/0.38	# Preprocessing time       : 0.001 s
0.10/0.38	# Presaturation interreduction done
0.10/0.38	
0.10/0.38	# Proof found!
0.10/0.38	# SZS status Theorem
0.10/0.38	# SZS output start CNFRefutation
0.10/0.38	thf(decl_22, type, meq_ind: mu > mu > $i > $o).
0.10/0.38	thf(decl_23, type, meq_prop: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_24, type, mnot: ($i > $o) > $i > $o).
0.10/0.38	thf(decl_25, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_26, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_27, type, mimplies: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_28, type, mimplied: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_29, type, mequiv: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_30, type, mxor: ($i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_31, type, mforall_ind: (mu > $i > $o) > $i > $o).
0.10/0.38	thf(decl_32, type, mforall_prop: (($i > $o) > $i > $o) > $i > $o).
0.10/0.38	thf(decl_33, type, mexists_ind: (mu > $i > $o) > $i > $o).
0.10/0.38	thf(decl_34, type, mexists_prop: (($i > $o) > $i > $o) > $i > $o).
0.10/0.38	thf(decl_35, type, mtrue: $i > $o).
0.10/0.38	thf(decl_36, type, mfalse: $i > $o).
0.10/0.38	thf(decl_37, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_38, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.10/0.38	thf(decl_39, type, mreflexive: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_40, type, msymmetric: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_41, type, mserial: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_42, type, mtransitive: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_43, type, meuclidean: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_44, type, mpartially_functional: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_45, type, mfunctional: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_46, type, mweakly_dense: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_47, type, mweakly_connected: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_48, type, mweakly_directed: ($i > $i > $o) > $o).
0.10/0.38	thf(decl_49, type, mvalid: ($i > $o) > $o).
0.10/0.38	thf(decl_50, type, minvalid: ($i > $o) > $o).
0.10/0.38	thf(decl_51, type, msatisfiable: ($i > $o) > $o).
0.10/0.38	thf(decl_52, type, mcountersatisfiable: ($i > $o) > $o).
0.10/0.38	thf(decl_53, type, rel_d: $i > $i > $o).
0.10/0.38	thf(decl_54, type, mbox_d: ($i > $o) > $i > $o).
0.10/0.38	thf(decl_55, type, mdia_d: ($i > $o) > $i > $o).
0.10/0.38	thf(decl_56, type, p: $i > $o).
0.10/0.38	thf(decl_57, type, q: $i > $o).
0.10/0.38	thf(decl_58, type, esk1_1: $i > $i).
0.10/0.38	thf(decl_59, type, esk2_0: $i).
0.10/0.38	thf(decl_60, type, esk3_0: $i).
0.10/0.38	thf(decl_61, type, esk4_0: $i).
0.10/0.38	thf(mand, axiom, ((mand)=(^[X6:$i > $o, X7:$i > $o]:(mnot @ (mor @ (mnot @ X6) @ (mnot @ X7))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mand)).
0.10/0.38	thf(mnot, axiom, ((mnot)=(^[X6:$i > $o, X3:$i]:(~((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mnot)).
0.10/0.38	thf(mor, axiom, ((mor)=(^[X6:$i > $o, X7:$i > $o, X3:$i]:(((X6 @ X3)|(X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mor)).
0.10/0.38	thf(mimplies, axiom, ((mimplies)=(^[X6:$i > $o, X7:$i > $o]:(mor @ (mnot @ X6) @ X7))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mimplies)).
0.10/0.38	thf(mequiv, axiom, ((mequiv)=(^[X6:$i > $o, X7:$i > $o]:(mand @ (mimplies @ X6 @ X7) @ (mimplies @ X7 @ X6)))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mequiv)).
0.10/0.38	thf(mvalid, axiom, ((mvalid)=(^[X6:$i > $o]:(![X3:$i]:((X6 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax', mvalid)).
0.10/0.38	thf(mbox_d, axiom, ((mbox_d)=(^[X6:$i > $o, X3:$i]:(![X14:$i]:((~((rel_d @ X3 @ X14))|(X6 @ X14)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^2.ax', mbox_d)).
0.10/0.38	thf(prove, conjecture, (mvalid @ (mimplies @ (mbox_d @ (mequiv @ p @ q)) @ (mequiv @ (mbox_d @ p) @ (mbox_d @ q)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove)).
0.10/0.38	thf(c_0_8, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[mand])).
0.10/0.38	thf(c_0_9, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.10/0.38	thf(c_0_10, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.10/0.38	thf(c_0_11, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])).
0.10/0.38	thf(c_0_12, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(fof_simplification,[status(thm)],[mequiv])).
0.10/0.38	thf(c_0_13, plain, ((mand)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((Z0 @ Z2)))|(~((Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8, c_0_9]), c_0_10])).
0.10/0.38	thf(c_0_14, plain, ((mimplies)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_9]), c_0_10])).
0.10/0.38	thf(c_0_15, plain, ((mequiv)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(~((((~((((~((Z0 @ Z2)))|(Z1 @ Z2)))))|(~((((~((Z1 @ Z2)))|(Z0 @ Z2))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
0.10/0.38	thf(c_0_16, plain, ((mvalid)=(^[Z0:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.10/0.38	thf(c_0_17, plain, ((mbox_d)=(^[Z0:$i > $o, Z1:$i]:(![X14:$i]:((~((rel_d @ Z1 @ X14))|(Z0 @ X14)))))), inference(fof_simplification,[status(thm)],[mbox_d])).
0.10/0.38	thf(c_0_18, negated_conjecture, ~(![X27:$i]:((~(![X24:$i]:((~(rel_d @ X27 @ X24)|~((~((~(p @ X24)|(q @ X24)))|~((~(q @ X24)|(p @ X24))))))))|~((~((~(![X25:$i]:((~(rel_d @ X27 @ X25)|(p @ X25))))|![X26:$i]:((~(rel_d @ X27 @ X26)|(q @ X26)))))|~((~(![X26:$i]:((~(rel_d @ X27 @ X26)|(q @ X26))))|![X25:$i]:((~(rel_d @ X27 @ X25)|(p @ X25)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]), c_0_14]), c_0_15]), c_0_16]), c_0_17])])).
0.10/0.38	thf(c_0_19, negated_conjecture, ![X31:$i, X32:$i, X34:$i]:((((~(p @ X31)|(q @ X31)|~(rel_d @ esk2_0 @ X31))&(~(q @ X31)|(p @ X31)|~(rel_d @ esk2_0 @ X31)))&(((~(rel_d @ esk2_0 @ X34)|(q @ X34)|(~(rel_d @ esk2_0 @ X32)|(p @ X32)))&(((rel_d @ esk2_0 @ esk4_0)|(~(rel_d @ esk2_0 @ X32)|(p @ X32)))&(~(p @ esk4_0)|(~(rel_d @ esk2_0 @ X32)|(p @ X32)))))&(((~(rel_d @ esk2_0 @ X34)|(q @ X34)|(rel_d @ esk2_0 @ esk3_0))&(((rel_d @ esk2_0 @ esk4_0)|(rel_d @ esk2_0 @ esk3_0))&(~(p @ esk4_0)|(rel_d @ esk2_0 @ esk3_0))))&((~(rel_d @ esk2_0 @ X34)|(q @ X34)|~(q @ esk3_0))&(((rel_d @ esk2_0 @ esk4_0)|~(q @ esk3_0))&(~(p @ esk4_0)|~(q @ esk3_0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])])).
0.10/0.38	thf(c_0_20, negated_conjecture, ![X3:$i]:(((q @ X3)|~((rel_d @ esk2_0 @ X3))|~((q @ esk3_0)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_21, negated_conjecture, ((rel_d @ esk2_0 @ esk4_0)|~((q @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_22, negated_conjecture, ![X3:$i]:(((p @ X3)|~((q @ X3))|~((rel_d @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_23, negated_conjecture, ((q @ esk4_0)|~((q @ esk3_0))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.10/0.38	thf(c_0_24, negated_conjecture, (~((p @ esk4_0))|~((q @ esk3_0))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_25, negated_conjecture, ![X3:$i]:(((p @ X3)|~((p @ esk4_0))|~((rel_d @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_26, negated_conjecture, ((rel_d @ esk2_0 @ esk3_0)|~((p @ esk4_0))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_27, negated_conjecture, ![X3:$i]:(((q @ X3)|~((p @ X3))|~((rel_d @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_28, negated_conjecture, ~((q @ esk3_0)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_21]), c_0_23]), c_0_24])).
0.10/0.38	thf(c_0_29, negated_conjecture, ((p @ esk3_0)|~((p @ esk4_0))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.10/0.38	thf(c_0_30, negated_conjecture, ![X3:$i]:(((q @ X3)|(rel_d @ esk2_0 @ esk3_0)|~((rel_d @ esk2_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_31, negated_conjecture, ((rel_d @ esk2_0 @ esk4_0)|(rel_d @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_32, negated_conjecture, ~((p @ esk4_0)), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_26]), c_0_28]), c_0_29])).
0.10/0.38	thf(c_0_33, negated_conjecture, ((rel_d @ esk2_0 @ esk3_0)|(q @ esk4_0)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
0.10/0.38	thf(c_0_34, negated_conjecture, (rel_d @ esk2_0 @ esk3_0), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_31]), c_0_32]), c_0_33])).
0.10/0.38	thf(c_0_35, negated_conjecture, ![X3:$i, X14:$i]:(((q @ X3)|(p @ X14)|~((rel_d @ esk2_0 @ X3))|~((rel_d @ esk2_0 @ X14)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.10/0.38	thf(c_0_36, negated_conjecture, ~((p @ esk3_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_34]), c_0_28])).
0.10/0.38	thf(c_0_37, negated_conjecture, ![X3:$i]:(((q @ X3)|~((rel_d @ esk2_0 @ X3)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_34]), c_0_36])).
0.10/0.38	thf(c_0_38, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_34]), c_0_28]), ['proof']).
0.10/0.38	# SZS output end CNFRefutation
0.10/0.38	# Parsed axioms                        : 72
0.10/0.38	# Removed by relevancy pruning/SinE    : 0
0.10/0.38	# Initial clauses                      : 49
0.10/0.38	# Removed in clause preprocessing      : 37
0.10/0.38	# Initial clauses in saturation        : 12
0.10/0.38	# Processed clauses                    : 36
0.10/0.38	# ...of these trivial                  : 0
0.10/0.38	# ...subsumed                          : 1
0.10/0.38	# ...remaining for further processing  : 35
0.10/0.38	# Other redundant clauses eliminated   : 0
0.10/0.38	# Clauses deleted for lack of memory   : 0
0.10/0.38	# Backward-subsumed                    : 10
0.10/0.38	# Backward-rewritten                   : 2
0.10/0.38	# Generated clauses                    : 40
0.10/0.38	# ...of the previous two non-redundant : 34
0.10/0.38	# ...aggressively subsumed             : 0
0.10/0.38	# Contextual simplify-reflections      : 4
0.10/0.38	# Paramodulations                      : 40
0.10/0.38	# Factorizations                       : 0
0.10/0.38	# NegExts                              : 0
0.10/0.38	# Equation resolutions                 : 0
0.10/0.38	# Propositional unsat checks           : 0
0.10/0.38	#    Propositional check models        : 0
0.10/0.38	#    Propositional check unsatisfiable : 0
0.10/0.38	#    Propositional clauses             : 0
0.10/0.38	#    Propositional clauses after purity: 0
0.10/0.38	#    Propositional unsat core size     : 0
0.10/0.38	#    Propositional preprocessing time  : 0.000
0.10/0.38	#    Propositional encoding time       : 0.000
0.10/0.38	#    Propositional solver time         : 0.000
0.10/0.38	#    Success case prop preproc time    : 0.000
0.10/0.38	#    Success case prop encoding time   : 0.000
0.10/0.38	#    Success case prop solver time     : 0.000
0.10/0.38	# Current number of processed clauses  : 11
0.10/0.38	#    Positive orientable unit clauses  : 2
0.10/0.38	#    Positive unorientable unit clauses: 0
0.10/0.38	#    Negative unit clauses             : 3
0.10/0.38	#    Non-unit-clauses                  : 6
0.10/0.38	# Current number of unprocessed clauses: 5
0.10/0.38	# ...number of literals in the above   : 17
0.10/0.38	# Current number of archived formulas  : 0
0.10/0.38	# Current number of archived clauses   : 24
0.10/0.38	# Clause-clause subsumption calls (NU) : 12
0.10/0.38	# Rec. Clause-clause subsumption calls : 12
0.10/0.38	# Non-unit clause-clause subsumptions  : 6
0.10/0.38	# Unit Clause-clause subsumption calls : 8
0.10/0.38	# Rewrite failures with RHS unbound    : 0
0.10/0.38	# BW rewrite match attempts            : 1
0.10/0.38	# BW rewrite match successes           : 1
0.10/0.38	# Condensation attempts                : 36
0.10/0.38	# Condensation successes               : 0
0.10/0.38	# Termbank termtop insertions          : 3212
0.10/0.38	
0.10/0.38	# -------------------------------------------------
0.10/0.38	# User time                : 0.004 s
0.10/0.38	# System time              : 0.003 s
0.10/0.38	# Total time               : 0.007 s
0.10/0.38	# Maximum resident set size: 1916 pages
0.10/0.38	
0.10/0.38	# -------------------------------------------------
0.10/0.38	# User time                : 0.006 s
0.10/0.38	# System time              : 0.005 s
0.10/0.38	# Total time               : 0.011 s
0.10/0.38	# Maximum resident set size: 1800 pages
0.10/0.38	EOF